The Domino Effect in Decentralized Wireless Networks

نویسندگان

  • Brage Ellingsaeter
  • Torleiv Maseng
چکیده

Convergence of resource allocation algorithms is well covered in the literature as convergence to a steady state is important due to stability and performance. However, research is lacking when it comes to the propagation of change that occur in a network due to new nodes arriving or old nodes leaving or updating their allocation. As change can propagate through the network in a manner similar to how domino pieces falls, we call this propagation of change the domino effect. In this paper we investigate how change at one node can affect other nodes for a simple power control algorithm. We provide analytical results from a deterministic network as well as a Poisson distributed network through percolation theory and provide simulation results that highlight some aspects of the domino effect. The difficulty of mitigating this domino effect lies in the fact that to avoid it, one needs to have a margin of tolerance for changes in the network. However, a high margin leads to poor system performance in a steady-state and therefore one has to consider a trade-off between performance and propagation of change.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decentralized Routing and Power Allocation in FDMA Wireless Networks based on H∞ Fuzzy Control Strategy

Simultaneous routing and resource allocation has been considered in wireless networks for its performance improvement. In this paper we propose a cross-layer optimization framework for worst-case queue length minimization in some type of FDMA based wireless networks, in which the the data routing and the power allocation problem are jointly optimized with Fuzzy distributed H∞ control strategy ....

متن کامل

A multiple criteria algorithm for planning the itinerary of mobile sink in wireless sensor networks

The mobile sink can increase the efficiency of wireless sensor networks. It moves in a monitored environment and collects the network nodes information. Thus, by the sink we can balance the power consumption and increases the network lifetime. Determining path of the sink's movement is usually modeled as an optimization problem where finding optimal solutions require collecting value of all the...

متن کامل

A Survey on Multicast Routing Approaches in Wireless Mesh Networks

Wireless mesh networks (WMNs) which mediates the broadband Internet access, have been recently received many attentions by the researchers. In order to increase capacity in these networks, nodes are equipped with multiple radios tuned on multiple channels emerging multi radio multi-channel WMNs (MRMC WMNs). Therefore, a vital challenge that poses in MRMC WMNs is how to properly assign channels ...

متن کامل

Optimizing the Event-based Method of Localization in Wireless Sensor Networks

A Wireless Sensor Network (WSN) is a wireless decentralized structure network consists of many nodes. Nodes can be fixed or mobile. WSN applications typically observe some physical phenomenon through sampling of the environment so determine the location of events is an important issue in WSN. Wireless Localization used to determine the position of nodes. The precise localization in WSNs is a co...

متن کامل

Quasi Random Deployment Strategy for Reliable Communication Backbones in Wireless Sensor Networks

Topology construction and topology maintenance are significant sub-problems of topology control. Spanning tree based algorithms for topology control are basically transmission range based type construction algorithms. The construction of an effective backbone, however, is indirectly related to the placement of nodes. Also, the dependence of network reliability on the communication path undertak...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1210.5219  شماره 

صفحات  -

تاریخ انتشار 2012